Optimality Conditions and Duality in Nonsmooth Multiobjective Programs
نویسندگان
چکیده
منابع مشابه
Optimality Conditions and Duality in Nonsmooth Multiobjective Programs
We study nonsmooth multiobjective programming problems involving locally Lipschitz functions and support functions. Two types of Karush-Kuhn-Tucker optimality conditions with support functions are introduced. Sufficient optimality conditions are presented by using generalized convexity and certain regularity conditions. We formulate Wolfe-type dual and Mond-Weirtype dual problems for our nonsmo...
متن کاملOptimality Conditions and Duality for Nonsmooth Multiobjective Optimization Problems with Cone Constraints and Applications
Abstract: In this work, a nonsmooth multiobjective optimization problem involving generalized invexity with cone constraints and Applications (for short, (MOP)) is considered. The Kuhn-Tucker necessary and sufficient conditions for (MOP) are established by using a generalized alternative theorem of Craven and Yang. The relationship between weakly efficient solutions of (MOP) and vector valued s...
متن کاملNecessary Optimality Conditions for Multiobjective Bilevel Programs
The multiobjective bilevel program is a sequence of two optimization problems, with the upper-level problem being multiobjective and the constraint region of the upper level problem being determined implicitly by the solution set to the lower-level problem. In the case where the Karush-Kuhn-Tucker (KKT) condition is necessary and sufficient for global optimality of all lower-level problems near...
متن کاملOptimality Conditions and Duality in Multiobjective Programming with Invexity*
( , ) ρ Φ − invexity has recently been introduced with the intent of generalizing invex functions in mathematical programming. Using such conditions we obtain new sufficiency results for optimality in multiobjective programming and extend some classical duality properties.
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2010
ISSN: 1029-242X
DOI: 10.1155/2010/939537